By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 24, Issue 4, pp. 673-921

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

SPARSE Reduces Conjunctively to TALLY

Harry Buhrman, Edith Hemaspaandra, and Luc Longpré

pp. 673-681

BibTeX  Abstract Full Text:  PDF

Size-Depth Tradeoffs for Algebraic Formulas

Nader H. Bshouty, Richard Cleve, and Wayne Eberly

pp. 682-705

BibTeX  Abstract Full Text:  PDF

Learning Arithmetic Read-Once Formulas

Nader H. Bshouty, Thomas R. Hancock, and Lisa Hellerstein

pp. 706-735

BibTeX  Abstract Full Text:  PDF

Amortized Communication Complexity

Tomás Feder, Eyal Kushilevitz, Moni Naor, and Noam Nisan

pp. 736-750

BibTeX  Abstract Full Text:  PDF

An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems

HÅkan Lennerstad and Lars Lundberg

pp. 751-764

BibTeX  Abstract Full Text:  PDF

Computing the Degree of Determinants via Combinatorial Relaxation

Kazuo Murota

pp. 765-796

BibTeX  Abstract Full Text:  PDF

Scheduling Tasks with AND/OR Precedence Constraints

Donald W. Gillies and Jane W.-S. Liu

pp. 797-810

BibTeX  Abstract Full Text:  PDF

Work-Preserving Speed-Up of Parallel Matrix Computations

Victor Y. Pan and Franco P. Preparata

pp. 811-821

BibTeX  Abstract Full Text:  PDF

Integer Linear Programs and Local Search for Max-Cut

Svatopluk Poljak

pp. 822-839

BibTeX  Abstract Full Text:  PDF

Easily Checked Generalized Self-Reducibility

Lane A. Hemaspaandra and Riccardo Silvestri

pp. 840-858

BibTeX  Abstract Full Text:  PDF

Approximating the Minimum Equivalent Digraph

Samir Khuller, Balaji Raghavachari, and Neal Young

pp. 859-872

BibTeX  Abstract Full Text:  PDF

Fixed-Parameter Tractability and Completeness I: Basic Results

Rod G. Downey and Michael R. Fellows

pp. 873-921

BibTeX  Abstract Full Text:  PDF